Quasi-optimal convergence rate for an adaptive method for the integral fractional Laplacian
نویسندگان
چکیده
For the discretization of integral fractional Laplacian $(-\Delta )^s$, $0 < s 1$, based on piecewise linear functions, we present and analyze a reliable weighted residual posteriori error estimator. In order to compensate for lack $L^2$-regularity in regime $3/4 this estimator includes as an additional weight power distance from mesh skeleton. We prove optimal convergence rates $h$-adaptive algorithm driven by Key analysis adaptive are local inverse estimates Laplacian.
منابع مشابه
Quasi-optimal Convergence Rate for an Adaptive Boundary Element Method
For the simple layer potential V that is associated with the 3D Laplacian, we consider the weakly singular integral equation V φ = f . This equation is discretized by the lowest order Galerkin boundary element method. We prove convergence of an h-adaptive algorithm that is driven by a weighted residual error estimator. Moreover, we identify the approximation class for which the adaptive algorit...
متن کاملQuasi-Optimal Convergence Rate for an Adaptive Finite Element Method
We analyze the simplest and most standard adaptive finite element method (AFEM), with any polynomial degree, for general second order linear, symmetric elliptic operators. As is customary in practice, the AFEM marks exclusively according to the error estimator and performs a minimal element refinement without the interior node property. We prove that the AFEM is a contraction, for the sum of th...
متن کاملQuasi-Optimal Convergence Rate of an Adaptive Discontinuous Galerkin Method
We analyze an adaptive discontinuous finite element method (ADFEM) for symmetric second order linear elliptic operators. The method is formulated on nonconforming meshes made of simplices or quadrilaterals, with any polynomial degree and in any dimension ≥ 2. We prove that the ADFEM is a contraction for the sum of the energy error and the scaled error estimator, between two consecutive adaptive...
متن کاملConvergence of an Approach for Solving Fredholm Functional Integral Equations
In this work, we give a product Nyström method for solving a Fredholm functional integral equation (FIE) of the second kind. With this method solving FIE reduce to solving an algebraic system of equations. Then we use some theorems to prove the existence and uniqueness of the system. Finally we investigate the convergence of the method.
متن کاملConvergence Rate and Quasi-Optimal Complexity of Adaptive Finite Element Computations for Multiple Eigenvalues
In this paper, we study an adaptive finite element method for multiple eigenvalue problems. We obtain both convergence rate and quasi-optimal complexity of the adaptive finite element eigenvalue approximation, without any additional assumption to those required in the adaptive finite element analysis for the boundary value problem. Our analysis is based on a certain relationship between the fin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2021
ISSN: ['1088-6842', '0025-5718']
DOI: https://doi.org/10.1090/mcom/3603